A Comparison of Sceptical NAF-Free Logic Programming Approaches
نویسندگان
چکیده
Recently there has been increased interest in logic programming-based default reasoning approaches which are not using negation-as-failure in their object language. Instead, default reasoning is modelled by rules and a priority relation among them. Historically the first logic in this class was Defeasible Logic. In this paper we will study its relationship to other approaches which also rely on the idea of using logic rules and priorities. In particular we will study sceptical LPwNF, courteous logic programs, and priority logic.
منابع مشابه
Credulous vs. Sceptical Semantics for Ordered Logic Programs
We present a semantic approach to the characterization of credulous and sceptical reasoning mechanisms, within the framework of ordered logic. One of the advantages of our approach is that it integrates thightly with "conservative" ordered logic semantics which is known to generalize "classical" (stable and wellfounded) logic programming semantics. This allows us to compare the conservative and...
متن کاملArgumentation-Based Proof Procedures for Credulous and Sceptical Non-monotonic Reasoning
We define abstract proof procedures for performing credulous and sceptical non-monotonic reasoning, with respect to the argumentation-theoretic formulation of non-monotonic reasoning proposed in [1]. Appropriate instances of the proposed proof procedures provide concrete proof procedures for concrete formalisms for non-monotonic reasoning, for example logic programming with negation as failure ...
متن کاملNonmonotonic abductive inductive learning
Inductive Logic Programming (ILP) is concerned with the task of generalising sets of positive and negative examples with respect to background knowledge expressed as logic programs. Negation as Failure (NAF) is a key feature of logic programming which provides a means for nonmonotonic commonsense reasoning under incomplete information. But, so far, most ILP research has been aimed at Horn progr...
متن کاملDefault Reasoning in CHR∨
CHR∨ has emerged as a versatile knowledge representation language, usable for an unparalleled variety of automated reasoning tasks: constraint solving, optimization, classification, subsumption, classical deduction, abduction, truth-maintenance, belief revision, belief update and planning. In this paper, we add default reasoning to this list, by showing how to represent default logic theories i...
متن کاملForgetting for Defeasible Logic
The concept of forgetting has received significant interest in artificial intelligence recently. Informally, given a knowledge base, we may wish to forget about (or discard) some redundant parts (such as atoms, predicates, concepts, etc) but still preserve the consequences for certain forms of reasoning. In nonmonotonic reasoning, so far forgetting has been studied only in the context of extens...
متن کامل